Space-efficient construction of Lempel–Ziv compressed text indexes

Space-efficient construction of Lempel-Ziv compressed text indexes

A compressed full-text self-index is a data structure that replaces a text and in addition gives indexed access to it, while taking space proportional to the compressed text size. This is very important nowadays, since one can accommodate the index of very large texts entirely in main memory, avoiding the slower access to secondary storage. In particular, the LZ-index [G. Navarro, Journal of Di...

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time

We show that the compressed suffix array and the compressed suffix tree of a string T can bebuilt in O(n) deterministic time using O(n log σ) bits of space, where n is the string length andσ is the alphabet size. Previously described deterministic algorithms either have a constructiontime that depends on the alphabet size or need ω(n log σ) bits of working space. ∗Cheriton School of...

Space-efficient Genome Comparisons with Compressed Full-text Indexes

Scalable Construction of Text Indexes

The suffix array is the key to efficient solutions for myriads of string processing problems in different applications domains, like data compression, data mining, or Bioinformatics. With the rapid growth of available data, suffix array construction algorithms had to be adapted to advanced computational models such as external memory and distributed computing. In this article, we present five s...

Compressed Text Indexes with Fast Locate

Compressed text (self-)indexes have matured up to a point where they can replace a text by a data structure that requires less space and, in addition to giving access to arbitrary text passages, support indexed text searches. At this point those indexes are competitive with traditional text indexes (which are very large) for counting the number of occurrences of a pattern in the text. Yet, they...